Nonuniform DFT based on nonequispaced sampling
نویسندگان
چکیده
In this paper, we propose a nonuniform DFT based on nonequispaced sampling in the frequency domain. It is useful to detect some specific frequencies such as in DTMF which is composed on two different frequencies, main (fundamental) frequency component among lots of harmonics, and feature detection from noisy signals. Some trials for nonuniform data processing via DFT are discussed and resampling method to obtain nonlinearly spaced samples in the frequency domain. Key-Words: NDFT, DFT, Resampling, HT, WDFT
منابع مشابه
Nonequispaced grid sampling in photoacoustics with a nonuniform fast Fourier transform.
To obtain the initial pressure from the collected data on a planar sensor arrangement in photoacoustic tomography, there exists an exact analytic frequency-domain reconstruction formula. An efficient realization of this formula needs to cope with the evaluation of the data’s Fourier transform on a nonequispaced mesh. We use the nonuniform fast Fourier transform to handle this issue and show its...
متن کاملAccelerating the Nonuniform Fast Fourier Transform ∗ Leslie Greengard
The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the numerical solution of partial differential equations. In a typical problem, one is given an irregular sampling of N data in the frequency domain and one is interested in reconstructing the corresponding function in the physical domain. When the sampling is uniform, the fa...
متن کاملThe type 3 nonuniform FFT and its applications
The nonequispaced or nonuniform fast Fourier transform (NUFFT) arises in a variety of application areas, including imaging processing and the numerical solution of partial differential equations. In its most general form, it takes as input an irregular sampling of a function and seeks to compute its Fourier transform at a nonuniform sampling of frequency locations. This is sometimes referred to...
متن کاملFast Iterative Reconstruction for MRI from Nonuniform k-space Data
In magnetic resonance imaging (MRI), methods that use a non-Cartesian (e.g. spiral) sampling grid in k-space are becoming increasingly important. Reconstruction is usually performed by resampling the data onto a Cartesian grid. In this paper we compare the standard approach (gridding) and an approach based on an implicit discretisation. We show that both methods can be solved efficiently with t...
متن کاملRapid Computation of the Discrete Fourier Transform
Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...
متن کامل